n, d = map(int, input().split())
music = list(map(int, input().split()))
time = 0
for i in range(n):
time += music[i] + 10
time -= 10
if d < time:
print(-1)
else:
print((2*n-2) + ((d - time)//5))
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ff first
#define ss second
#define as(v) v.begin(),v.end()
#define ds(v) v.rbegin(),v.rend()
#define mod 1000000007
#define dbgs(x) cout << #x << " " << x << endl;
#define dbgm(x) cout<<#x;cout<<" { ";rep(i,0,x.size()){cout<<x[i]<<" ";}cout<<"}";cout<<endl;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
void solve() {
ll n, m, d = 0; cin>> n >> m;
rep(i, 0, n) {
ll s; cin>> s;
d += s;
}
d += (n - 1) * 10;
if (d <= m) {
cout<< (n - 1) * 2 + (m - d) / 5 << endl;
return;
}
cout<< -1 << endl;
}
int main() {
fast_io;
ll t = 1;
// cin>> t;
while (t--) solve();
return 0;
}
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |